Average Time Complexity Classes
نویسندگان
چکیده
We extend Levin's theory of average polynomial time to arbitrary time bounds and prove that average time complexity classes form as ne a hierarchy as do deterministic time complexity classes.
منابع مشابه
Structure in Average Case Complexity
In Schapire gave an equivalent characterization of Levin s notion of functions that are polynomial on average This characterization gives a very smooth translation from worst case complexity to average case complexity of the notions for time and space complexity We prove tight space and time hierarchy theorems and discuss the structure of deterministic and nondeterministic average case complexi...
متن کاملStructural Average Case Complexity
Levin introduced an average case complexity measure based on a notion of polynomial on average and de ned average case polynomial time many one reducibility among randomized decision problems We generalize his notions of average case complexity classes Random NP and Average P Ben David et al use the notation of hC Fi to denote the set of randomized de cision problems L such that L is a set in C...
متن کاملThe University of Chicago Hierarchy Theorems and Resource Tradeoffs for Semantic Classes a Dissertation Submitted to the Faculty of the Division of the Physical Sciences in Candidacy for the Degree of Doctor of Philosophy Department of Computer Science By
Computational complexity theory studies the minimum resources (time, space, randomness etc.) to solve computational problems. Two fundamental questions in this area are: 1. Can more problems be solved given more of a given resource? A positive answer to this question is known as a hierarchy theorem. 2. Can one resource be traded off with another when solving a given problem? Such a result is kn...
متن کاملA Smoothed Complexity Theory
Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying complexity classes, like P and Avg-P, respectively. While worst-case or average-case analysis give us a means to talk about the running time of a particular algorithm, complexity classes allows us to talk about the in...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 2 شماره
صفحات -
تاریخ انتشار 1995